Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:
Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT
In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:
- come viene usata la parola
- frequenza di utilizzo
- è usato più spesso nel discorso orale o scritto
- opzioni di traduzione delle parole
- esempi di utilizzo (varie frasi con traduzione)
- etimologia
Cosa (chi) è 2-satisfiability - definizione
2-satisfiability
![The [[median graph]] representing all solutions to the example 2-satisfiability instance whose implication graph is shown above.](https://commons.wikimedia.org/wiki/Special:FilePath/2SAT median graph.svg?width=200 "The [[median graph]] representing all solutions to the example 2-satisfiability instance whose implication graph is shown above.")
THEORETICAL COMPUTER SCIENCE PROBLEM
2-SAT; 2SAT; MAX-2-SAT; Maximum 2-satisfiability; Max 2-sat; MAX-2SAT; Krom-clause; 2-CNF-SAT; Krom formula; Krom formulae
In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraints on pairs of variables. It is a special case of the general Boolean satisfiability problem, which can involve constraints on more than two variables, and of constraint satisfaction problems, which can allow more than two choices for the value of each variable.
Boolean satisfiability problem
![(''x'' ∨ ''x'' ∨ ''y'') ∧ (¬''x'' ∨ ¬''y'' ∨ ¬''y'') ∧ (¬''x'' ∨ ''y'' ∨ ''y'')}} reduced to a [[clique problem]]. The green vertices form a 3-clique and correspond to the satisfying assignment ''x''=FALSE, ''y''=TRUE.](https://commons.wikimedia.org/wiki/Special:FilePath/Sat reduced to Clique from Sipser.svg?width=200 "(''x'' ∨ ''x'' ∨ ''y'') ∧ (¬''x'' ∨ ¬''y'' ∨ ¬''y'') ∧ (¬''x'' ∨ ''y'' ∨ ''y'')}} reduced to a [[clique problem]]. The green vertices form a 3-clique and correspond to the satisfying assignment ''x''=FALSE, ''y''=TRUE.")
PROBLEM OF DETERMINING IF A BOOLEAN FORMULA COULD BE MADE TRUE
3-satisfiability; Boolean satisfiability; 3-SAT; 3cnfsat; 3cnf; 3cnf-sat; 3SAT; Satisfiability of boolean expressions; One-in-three 3SAT; Propositional satisfiability; K-SAT; K-cnf-sat; Counted Boolean Satisfiability Problem; Boolean Satisfiability; CNFSAT; Satisfiability Problem; CNF-SAT; Boolean SAT; Boolean SAT solver; Unambiguous SAT; Unique-SAT; SAT solving; XOR-satisfiability; 1-in-3-SAT; XOR-SAT; List of SAT solvers; SAT problem; Algorithms for solving the boolean satisfiability problem; Methods for solving SAT; Parallel SAT solver; Linear SAT; Algorithms for solving SAT; Propositional satisfiability problem
In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE.
Satisfiable
ELEMENTARY CONCEPT OF SEMANTICS
Satisfiability problem; Satisfiable; Unsatisfiable; Satisfiability and validity; Satisfiability (logics); Finite satisfiability (logics)
·adj That may be satisfied.
